Appendices with PVS source code and proofs for the document Nova Micro-Hypervisor Verification B PVS Theory Sources

Read Write[State, Data : Type] : TheoryBeginIMPORTING Memory Change[State]IMPORTING State Transformer Lift, Interpreted Datadt : Var (interpreted data type?[Data]) % dt aka Data typeaddr : Var Addresss : Var State % s aka statedata : Var Datapm : Var Memory struct[State]valid in mem(pm,dt)(addr)(s) : bool =Cases memory read list(pm)(addr, size(uidt(dt)))(s) OFOK(sn, bl) : dt‘uidt‘valid?(bl, addr)Else trueEndCasesread data(pm,dt)(addr) : [State −> ExprResult[State, Data]] =(memory read list(pm)(addr, size(uidt(dt))) ##Lambda(bl : list[Byte]) : ok lift(from byte(dt)(bl, addr)))write data(pm,dt)(addr, data) : [State −> ExprResult[State, Unit]] =memory write list(pm)(addr, to byte(dt)(data, addr))% proof status :−)read data valid in mem : LemmaOK?(read data(pm, dt)(addr)(s)) Implies valid in mem(pm, dt)(addr)(s)End Abstract Read WriteB.2 allocators.pvs Allocator[State : Type] : Theory% Specification of memory allocators working on plain memory,% such as the stack allocator and the one for global variables.BeginImporting Plain Memory[State]% The allocator interface consists of two real methods and four% logical ones.% alloc allocates memory